A Symmetry Preserving Alternating Projection Method for Matrix Model Updating
نویسندگان
چکیده
The Matrix Model Updating Problem (MMUP), considered in this paper, concerns updating a symmetric second-order finite element model so that the updated model reproduces a given set of desired eigenvalues and eigenvectors by replacing the corresponding ones from the original model, and preserves the symmetry of the original model. In an optimization setting, this is a constrained nonlinear optimization problem. Taking advantage of the special structure of the constraint sets, it is first shown that the MMUP can be formulated as an optimization problem over the intersection of some special subspaces and linear varieties on the space of matrices. Using this formulation, an alternating projection method is then proposed and analyzed. The projections onto the involved subspaces and linear varieties are characterized. To the best of our knowledge, an alternating projection method for MMUP has not been proposed in the literature earlier. A distinct practical feature of the proposed method is that it is implementable using only a few measured eigenvalues and eigenvectors. No knowledge of the eigenvalues and eigenvectors of the associated quadratic matrix pencil is required. The results of our numerical experiments on both illustrative and benchmark problems show that the algorithm works well. The paper concludes with some future research problems.
منابع مشابه
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملDamped DQE Model Updating of a Three-Story Frame Using Experimental Data
In this paper, following a two-stage methodology, the differential quadrature element (DQE) model of a three-story frame structure is updated for the vibration analysis. In the first stage, the mass and stiffness matrices are updated using the experimental natural frequencies. Then, having the updated mass and stiffness matrices, the structural damping matrix is updated to minimize the error be...
متن کاملParticle Swarm Optimization (PSO) for Structural Damage Detection
A Particle Swarm Optimization (PSO) algorithm is examined to solve the inverse problem in structural health monitoring. The damage detection problem is formulated as a PSO problem to find a damaged stiffness matrix that satisfies the structure’s eigenequation and satisfying the necessary symmetry, sparsity, positive definiteness, and damage localization constraints. Finally, the PSO technique i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008